The Giant Component Is Normal D. Barraez and S. Boucheron and W. Fernandez

نویسندگان

  • D. BARRAEZ
  • S. BOUCHERON
  • W. FERNANDEZ DE LA VEGA
چکیده

We prove a central limit theorem for the uctuations of the size of the Giant Component in a random graph with small edge probability.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multifocal Central Giant Cell Granuloma - A Case Report

Central giant cell granuloma is a benign, aggressive neoplasm composed of multinucleated giant cells that almost exclusively occurs in the jaws though extra-gnathic incidence is rare.Multifocal CGCGs of the jaws are very rare and suggestive of systemic diseases such as hyperparathyroidism,an inherited syndrome such as Noonan-like multiple giant cell lesion syndrome or other disorders.Very few c...

متن کامل

Construction of a surface pencil with a common special surface curve

In this study, we introduce a new type of surface curves called $D$-type curve. This curve is defined by the property that the unit Darboux vector $vec{W}_{0} $ of a surface curve $vec{r}(s)$ and unit surface normal $vec{n} $ along the curve $vec{r}(s)$ satisfy the condition $leftlangle vec{n} ,vec{W}_{0} rightrangle =text{constant}$. We point out that a $D$-type curve is a geodesic curve or an...

متن کامل

Giant Cell Carcinoma of Endometrium: a Rare Clinical Entity

Giant cell carcinoma of the endometrium is a rare and an aggressive tumor that should be distinguished from other endometrial tumors with a prominent giant cell component, including trophoblastic tumors, certain primary sarcomas, and malignant mixed müllerian tumors. At present, cumulative data on this rare histological variant is limited and the prognostic significance of the presence and the ...

متن کامل

The metric dimension and girth of graphs

A set $Wsubseteq V(G)$ is called a resolving set for $G$, if for each two distinct vertices $u,vin V(G)$ there exists $win W$ such that $d(u,w)neq d(v,w)$, where $d(x,y)$ is the distance between the vertices $x$ and $y$. The minimum cardinality of a resolving set for $G$ is called the metric dimension of $G$, and denoted by $dim(G)$. In this paper, it is proved that in a connected graph $...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999